Behaviour of the fast consistency algorithm in the set of replicas with multiple zones with high demand
نویسندگان
چکیده
In this work we have investigated the behaviour of the fast consistency algorithm for the propagation of changes in a set of replicas with multiple zones with high read demand. We demonstrate that the algorithm does not perform well in regions with a more than one valley of high demand surrounded by lower demand. The situation is characterized and a potential solution to change the distribution of demand equivalent to a single valley of demand where this algorithm provides high performance.
منابع مشابه
Generalization of the Fast Consistency Algorithm to a Grid with Multiple High Demand Zones
One of the main challenges of grid systems of large scale and data intensive is that of providing high availability and performance, in spite of the unreliability and delay occasioned by the size of Internet. Replication enables us to meet such a challenge with success. In the context of weak consistency, the fast consistency algorithm prioritizes replicas with high demand. Nevertheless, the fa...
متن کاملA Demand based Algorithm for Rapid Updating of Replicas
In many Internet scale replicated system, not all replicas can be dealt with in the same way, since some will be in greater demand than others. In the case of weak consistency algorithms, we have observed that updating first replicas having most demand, a greater number of clients would gain access to updated content in a shorter period of time. In this work we have investigated the benefits th...
متن کاملUnit commitment by a fast and new analytical non-iterative method using IPPD table and “λ-logic” algorithm
Many different methods have been presented to solve unit commitment (UC) problem in literature with different advantages and disadvantages. The need for multiple runs, huge computational burden and time, and poor convergence are some of the disadvantages, where are especially considerable in large scale systems. In this paper, a new analytical and non-iterative method is presented to solve UC p...
متن کاملBehavior of Fast Consistency Algorithms in Large Decentralized Systems
Information replication is a major technique for improving the efficiency and autonomy of many distributed applications. Weak consistency algorithms allow us to propagate changes in an arbitrary, changing storage network in a self-organizing way. The weak consistency algorithms generate very little traffic overhead; they have low latency and are scalable, in addition to being fault tolerant. In...
متن کاملComparison the Accuracy of Fetal Brain Extraction from T2-Half-Fourier Acquisition Single-Shot Turbo Spin-Echo (HASTE) MR Image with T2-True Fast Imaging with Steady State Free Precession (TRUFI) MR Image by Level Set Algorithm
Background Access to appropriate images of fetal brain can greatly assist to diagnose of probable abnormalities. The aim of this study was to compare the suitability of T2-True Fast Imaging with Steady State Free Precession (T2-TRUFI), and T2-Half-Fourier Acquisition Single-Shot Turbo Spin-Echo (T2- HASTE( magnetic resonance imaging (MRI) to extract the fetal brain using the level set algorithm...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2002